#include <stdio.h>
#include <memory.h>
bool prime[440];
int div[440];
int sang[440];
int yin[440];
int count,su[440],i,j,n,k,num;
_int64 sum;

int main()
{
	//freopen("1.txt","r",stdin);
	prime[2]=1;
	su[0]=2;
	count=1;
	for(i=3;i<=431;i++)
	{
		for(j=0;j<count;j++)
			if(i%su[j]==0)
			{
				div[i]=su[j];
				sang[i] = i / div[i]; // add sang here
				break;
			}
		if(j==count)
		{
			prime[i]=1;
			su[count++]=i;
		}
	}
	while(scanf("%d%d",&n,&k)==2)
	{
		memset(yin,0,sizeof(yin));
		sum=1;
		if(n-k<k)
			k=n-k;
		if(k!=0)
		{
			for(i=n,j=k;i>n-k;i--)
			{
				num=i;
				while(j>1 && num%j==0)
				{
					num=num/j;
					j--;
				}
				if(num>1)
				{
					while(prime[num]==0)
					{
						yin[div[num]]++;
					//	num=num / div[num]; change it to:
						num = sang[num];
					}
					yin[num]++;
				}
			}
			if(j>1)
			{
				for(j;j>1;j--)
				{
					num=j;
					while(prime[num]==0)
					{
						yin[div[num]]--;
						num=num / div[num];
					}
					yin[num]--;
				}
			}
			for(i=0;su[i]<=n && i<count;i++)
				if(yin[su[i]]!=0)
					sum *= (yin[su[i]]+1);
		}
		printf("%I64d\n",sum);
	}
	return 0;
}
